Medium and system for controlling atm traffic using bandwidth allocation technology

ABSTRACT

A medium and system for managing asynchronous transfer mode (ATM) traffic in a computer system is disclosed. The computer system is used in sending, receiving, or sending and receiving a plurality of ATM flows. Each ATM flow has a plurality of ATM cells, a minimum ATM bandwidth guarantee, and a maximum ATM bandwidth. The medium and system include determining whether excess bandwidth exists for the ATM flows. The method and system also include gracefully increasing a portion of the ATM cells transmitted for each ATM flow during periods of excess bandwidth. The portion of the ATM cells transmitted is not more than the maximum ATM bandwidth limit. If an ATM flow presents a sufficient offered load, the portion of the ATM cells transmitted in the flow is not less than a minimum ATM bandwidth guarantee.

CROSS-REFERENCE TO RELATED APPLICATIONS

Under 35 USC 120, this is a divisional application and claims thebenefit of priority to U.S. patent application Ser. No. 11/946,057,filed Nov. 28, 2007, entitled “Method and System for Controlling ATMTraffic Using Bandwidth Allocation Technology”, which is a continuationapplication and claims the benefit of U.S. patent application Ser. No.10/442,7625 filed May 21, 2003, entitled “Method and System forControlling ATM Traffic Using Bandwidth Allocation Technology”, all ofwhich is incorporated herein by reference. The present invention isrelated to co-pending U.S. patent application Ser. No. 10/117,814,entitled “METHOD AND SYSTEM FOR PRIORITY ENFORCEMENT WITH FLOW CONTROL”and assigned to the assignee of the present invention, which has issuedas U.S. Pat. No. 7,142,552. The present invention is also related toco-pending U.S. patent application Ser. No. 10/118,493, entitled“PRIORITY-BASED BANDWIDTH ALLOCATION WITHIN REAL-TIME AND NON-REAL-TIMETRAFFIC STREAMS” and assigned to the assignee of the present invention.

FIELD OF THE INVENTION

The present invention relates to computer systems, and more particularlyto a method and system for managing asynchronous transfer mode (ATM)traffic.

BACKGROUND OF THE INVENTION

ATM is used in providing several types of communication traffic,particularly for traffic carried over long distances in general trafficin ATM can be conceived of virtual connections between networks. Eachvirtual connection could include many concurrent sessions, such asTCP/IP sessions.

Like traffic that is typically carried over the Internet, for exampleusing DiffServ, ATM provides for different levels of service. Inparticular, ATM includes six service categories: constant bit rate(CBR), realtime variable bit rate (rt-VBR), non-realtime variable bitrate (nrt-VBR), unspecified bit rate (UBR), available bit rate (ABR),and guaranteed frame rate (GFR). In order to monitor the levels ofservice, ATM uses a generic cell rate algorithrm (GCRA). A networkadministrator of a network receiving traffic uses the GCRA to determinewhether the traffic offered is consistent with their service agreementand any quality of service parameters. The GCRA can be used by thesender to determine whether the network treats the traffic offeredcorrectly. Stated differently, the GCRA allows the buyer or seller ofATM service to determine whether bandwidth bought or sold, whichcorresponds to the flows in the traffic within the network, conforms toa service agreement.

Furthermore, the six categories of ATM service can be described usingseveral parameters. Peak cell rate (PCR) is the maximum bandwidth thatcan be allocated to a flow of a particular level of service. Cell delayvariation tolerance (CDVT) is a jitter specification for a level ofservice. In addition, the sustainable cell rate (SCR) is a minimumbandwidth guarantee specified for a particular flow. Maximum burst size(MBS) is the maximum burst size allowed for the flow. The minimum cellrate (MCR) is the minimum bandwidth guarantee specified for the flow.The MCR is used only by the ABR and GFR levels of service. The Maximumframe size (MFS) is used only by GFR and, as the name indicates,specifies the maximum frame size for the GFR flow. Furthermore, anetwork administrator for a network using ATM specifies parametersincluding: peak-to-peak cell delay variation (peak-to-peak CDV) tospecify the allowed jitter, the maximum cell transit delay (MaxCTD) tospecify the allowed latency, and the cell loss rate (CLR) to specify theallowed cell loss rate.

Using the parameters above, ATM traffic can provide different levels ofservice. ATM standards do require that the parameters be met and thattraffic may be monitored at the entrance and exit of each network. Inother words, ATM specifies the goals, such as the MCR, to be met foreach flow. However, ATM does not otherwise specify how traffic iscontrolled to meet the goals for each the above categories of service.

FIG. 1 depicts a conventional system 10 used in providing differentlevels of service for ATM traffic. The conventional system 10 ispreferably used at the edge of a network (not explicitly shown). Thus,the conventional system 10 is used to ensure that flows entering and/orleaving the network conform to the parameters for each level of service.For clarity, the conventional system 10 is depicted as having five flows20, 22, 24, 26, and 28. However, the conventional system 10 typicallymanages a large number of flows. The five flows 20, 22, 24, 26, and 28include two realtime flows 20 and 22, and three non-realtime flows 24,26, and 28. For example, the realtime flows 20 and 22 might be rt-VBRand CBR flows and the non-realtime flows 24, 26, and 28 might benrt-VBR, UBR, and CBR flows. Each flow 20, 22, 24, 26, and 28 has acorresponding queue 30, 32, 34, 36, and 38 in which ATM cells may bestored prior to further processing.

The system 10 also includes a conventional scheduler 40 and an entranceto or exit from the network 42. Thus, the flows 20, 22, 24, 26, and 28are either entering or exiting the network of which the conventionalsystem 10 is a part. The conventional scheduler 40 also has knowledge ofthe ATM service category and, therefore, the parameters for each of theflows 20, 22, 24, 26, and 28. The conventional scheduler 40 monitors thetraffic for each of the flows 20, 22, 24, 26, and 28. In particular, theconventional scheduler 40 monitors each packet, or cell, for each flow22, 24, 26, and 28. Based upon the ATM service categories and parametersfor the flows 20, 22, 24, 26, and 28, and the traffic in each of theflows 20, 22, 24, 26, and 28, the conventional scheduler 40 determinesfrom which corresponding queue 30, 32, 34, 36, and 38, respectively, toselect the next packet for processing. The conventional scheduler 40thus selects an ATM cell from one of the queues 30, 32, 34, 36, or 38and outputs the ATM cell to the entrance or exit from the network 42.Thus, ATM traffic having different levels of service can be managed.

Although the conventional method 10 functions, one of ordinary skill inthe art will readily recognize that the conventional scheduler 40 iscomplex. The conventional scheduler 40 understands the ATM servicecategory for each flow 20, 22, 24, 26, and 28. The conventionalscheduler 40 also obtains data relating to each ATM cell in each flow20, 22, 24, 26, and 28. Thus, the conventional scheduler 40 must monitorthe flow of each packet out of each queue 30, 32, 34, 36, and 38. Theconventional scheduler 40 also transmits packets for each flow 20, 22,24, 26, and 28 such that the ATM service parameters are met for eachflow 20, 22, 24, 26, and 28. In order to perform all of these serviceson the individual ATM cell level, the conventional scheduler 40 iscomplex.

Furthermore, the conventional ATM scheduler 40 does not in itselfprovide for a mechanism to discard excess traffic. Discards may bemanaged by comparing the occupancy of Queue 130 with a threshold anddiscarding arriving traffic if arid only if the threshold is exceeded.The same policy may be applied to Queue 32 and so on. However, if such athreshold has a relatively low value, then bursts of traffic may beunnecessarily discarded; if a threshold has relatively high value, thenduring an episode of steady congestion, all surviving packets may haveundesirably high queueing latency. Therefore setting discard thresholdsmay present the administrator with burdensome and confusing performancerequirements. Consequently, providing different levels of ATM servicesin a conventional manner may be relatively difficult and inefficient.

Accordingly, what is needed is a medium and system for providing bettermanagement of different levels of ATM services. The present inventionaddresses such a need.

SUMMARY OF THE INVENTION

The present invention provides method for managing asynchronous transfermode (ATM) traffic in a computer system. The computer system is used insending, receiving, or sending and receiving a plurality of ATM flows.Each of the plurality of ATM flows has a plurality of IP packetsconsisting of ATM cells. The method and system comprise determiningwhether excess bandwidth exists for the plurality of ATM flows. Each ofthe plurality of ATM flows has a minimum ATM bandwidth guarantee and amaximum ATM bandwidth. The method and system also comprise gracefullyincreasing a portion of the plurality of ATM cells transmitted for eachATM flow of a portion the plurality of ATM flows having excess bandwidthexisting. The portion of the plurality of ATM cells transmitted is notmore than the maximum ATM bandwidth limit. If the plurality of ATM cellspresents a sufficient offered load, the portion of the plurality of ATMcells transmitted is not less than a minimum ATM bandwidth guarantee.

According to the method disclosed herein, the present invention allowsATM traffic to be efficiently managed.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a conventional system for managing ATMtraffic

FIG. 2 is a high-level flow chart depicting one embodiment of a methodin accordance with the present invention for managing ATM traffic,preferably using a switch.

FIG. 3 is a more detailed flow chart depicting one embodiment of amethod in accordance with the present invention for managing ATMtraffic.

FIG. 4 is a block diagram of one embodiment of a system in accordancewith the present invention for managing ATM traffic.

DETAILED DESCRIPTION OF THE INVENTION

The present invention relates to an improvement in computer systems andcomputer networks. The following description is presented to enable oneof ordinary skill in the art to make and use the invention and isprovided in the context of a patent application and its requirements.Various modifications to the preferred embodiment will be readilyapparent to those skilled in the art and the generic principles hereinmay be applied to other embodiments. Thus, the present invention is riotintended to be limited to the embodiment shown, but is to be accordedthe widest scope consistent with the principles and features describedherein.

The present invention provides method for managing asynchronous transfermode (ATM) traffic in a computer system. The computer system is used insending receiving, or sending and receiving a plurality of ATM flows.Each of the plurality of ATM flows has a plurality of ATM cells. Themethod and system comprise determining whether excess bandwidth existsfor the plurality of ATM flows. Each of the plurality of ATM flows has aminimum ATM bandwidth guarantee (possibly zero) and a maximum ATMbandwidth limit. The method and system also comprise gracefullyincreasing a portion of the plurality of ATM cells transmitted for eachATM flow of a portion the plurality of ATM flows having excess bandwidthexisting. The portion of the plurality of ATM cells transmitted is notmore than the maximum ATM bandwidth limit. If the plurality of ATM cellspresents a sufficient offered load, the portion of the plurality of ATMcells transmitted is not less than a minimum ATM bandwidth guarantee.

According to the method disclosed herein, the present invention allowsATM traffic to be managed gracefully and efficiently. In addition, highutilization of the processing resources and low queueing latency duringsteady congestion may be ensured while allowing for excess bandwidth tobe allocated fairly among different flows.

The present invention will be described in terms of particular computersystems. However, one of ordinary skill in the art will readilyrecognize that this method and system will operate effectively for otherand/or additional computer systems having different and/or additionalcomponents. The present invention is described in the context of systemslocated at the edges of networks. However, one of ordinary skill in theart will readily recognize that the computer systems could be locatedelsewhere. In addition, the present invention is described in the context of queues. However, one of ordinary skill in the art will readilyrecognize that each queue could be a logical partition of a singleresource. Furthermore, the present invention is described in the contextof methods having certain steps performed in a particular order.However, nothing prevents the use of methods having other and/oradditional steps and/or a different order of steps not inconsistent withthe present invention.

To more particularly illustrate the method and system in accordance withthe present invention, refer now to FIG. 2, depicting one embodiment ofa method 100 for managing ATM traffic having different servicecategories. The method 100 is preferably accomplished using technologydescribed in co-pending U.S. patent application Ser. No. 10/117,814 andentitled “METHOD AND SYSTEM FOR PRIORITY ENFORCEMENT WITH FLOW CONTROL”and assigned to the assignee of the present invention and co-pendingU.S. patent application Ser. No. 10/118,493, entitled “PRIORITY-BASEDBANDWIDTH ALLOCATION WITHIN REALTIME AND NON-REALTIME SERVICES” andassigned to the assignee of the present invention. Applicants herebyincorporate by reference the above-mentioned co-pending U.S. PatentApplications.

The method 100 can be used with a switch (not shown) such as a switchhaving multiple blades (not shown) and multiple ports on each blade. Themethod 100 could also be used on another system. In a preferredembodiment, the method 100 is implemented in enqueueing mechanism(s) forone or more queues.

The method 100 is preferably repeated at a constant frequency, each timea refresh period has expired. It is also preferably used to manage ATMtraffic at the edge of a network. Thus, the switch or other mechanismimplementing the method 100 is preferably located at the edge of anetwork and provides ATM traffic to or from an external destination orsource, respectively. The method 100 will, therefore, be described inthe con text of the network receiving or sending ATM cells at thenetwork's edge. However, nothing prevents the method 100 from being usedin another portion of the network (not shown), between individual hostsor between networks (not shown).

The method 100 preferably commences after the network administrator forthe network (not shown), or other authorized user, has set a minimumbandwidth guarantee and maximum bandwidth limit for each flow of ATMcells that is to be controlled. The method 100 also preferably commencesafter any remaining parameters for each of the ATM flows has been set.Thus, for flows added after the method 100 initially starts, the method100 preferably controls traffic for the flow only after the minimumbandwidth guarantee and maximum bandwidth limit are set. The minimumbandwidth guarantee is greater than or equal to zero. The minimumbandwidth guarantee and the maximum bandwidth limit depend upon the ATMservice category. For example, for a CBR flow, the minimum bandwidthguarantee and the maximum bandwidth limit are preferably set to the samelevel, the PCR. For rt-VBR, the minimum bandwidth guarantee ispreferably set to SCR, while the maximum bandwidth limit is preferablyset to PCR. PCR is greater than SCR for rt-VBR. In addition, the MBS forrt-VBR is preferably set by the administrator prior to the method 100being used to control the flow. For UBR, the minimum bandwidth guaranteeis set equal to zero or, in a preferred embodiment, slightly greaterthan zero. The minimum bandwidth guarantee is preferably set slightlygreater than zero so that there is always a trickle of ATM traffic whenATM traffic is offered for the UBR flow, which may make debuggingsimpler. In addition, a network administrator may set an optionalminimum desired cell rate and associate the flow with a class through abehavior class selector attribute. For ABR, the network administratorpreferably sets the minimum bandwidth guarantee equal to the MCR and themaximum bandwidth limit to PCR. For ABR, MCR is not more than PCR. ForABR, congestion control feedback and the minimum per hop bandwidth valuemay also be set. For GFR, the minimum bandwidth guarantee and maximumbandwidth limit are set to MCR and PCR, respectively. Furthermore, MFSand early packet discard (EPD) can also be implemented for GFR inconjunction with the method 100. EPD ensures that if one ATM cell, whichmay be part of a larger IP packet, is discarded, the remaining ATM cellsfor the IP packet are also discarded. In addition, in order to ensurethat the computer system can handle the traffic through the system, thesum of the maximum bandwidth limits for ATM flows of realtime trafficplus a sum of the minimum bandwidth guarantees for ATM flowscorresponding of non-realtime traffic is less than or equal to a maximumcapacity of the computer system.

Whether excess bandwidth exists for the ATM flows being controlled isdetermined, via step 102. The determination of excess bandwidth is madebased upon the ATM flows, rather than by monitoring individual packetsin the ATM flows. In a preferred embodiment, the ATM cells in the ATMflows are being provided to one or more queues. Whether excess bandwidthexists for a particular ATM flow is preferably determined based upon oneor more of the following: the occupancy in the corresponding queue(s),the rate of change of occupancy in the queue(s), and the flow rate forthe particular ATM flow. For example, when the corresponding queue(s) isbelow a particular threshold, preferably expressed as a percentage ofoccupancy of the queue, excess bandwidth exists. When the occupancy ofthe queue is below a larger threshold and decreasing at a particularrate, excess bandwidth also exists. Otherwise excess bandwidth may beconsidered not to exist. The thresholds and rates of decrease may beselected based upon the application.

In a preferred embodiment, step 102 determines whether excess bandwidthexists once for all realtime ATM traffic and once for all non-realtimeATM traffic. Thus, in a preferred embodiment, step 102 includesmonitoring one queue that stores realtime traffic and monitoring anotherqueue that stores non-realtime traffic, then determining whether excessbandwidth exists for the corresponding flows. Thus, the determination ofexcess bandwidth is preferably the same for all ATM flows that includerealtime traffic. Similarly, the determination of excess bandwidth ispreferably the same for all ATM flows that include non-realtime traffic.However, nothing prevents the use of a finer definition of excessbandwidth flow by flow based upon a larger number of queues and/ororganizing the queues differently. In addition, the determination ofexcess bandwidth in step 102 is not based upon monitoring of individualATM cells. Instead, queue statistics or other indicator of the flow ofATM traffic for the ATM flows is used.

If it is determined that excess bandwidth exists for certain ATM flows,then the flow rate of ATM cells transmitted for these flows isgracefully increased, via step 104. A graceful increase or decreaseoccurs when the flow rate is gradually increased or decreased,respectively toward the upper limit (maximum bandwidth limit) or lowerlimit (minimum bandwidth guarantee), respectively. This could includelinearly or exponentially increasing or decreasing the flow rate of theATM cells transmitted.

Also in step 104, it is ensured that the transmission of ATM cells forthese flows is such that enough ATM cells are transmitted to meet theminimum bandwidth guarantee if a sufficient load is offered. In otherwords, the minimum bandwidth guarantee is met as long as enough ATMcells are in the flow. If a sufficient load is not offered, then theflow may have less than the minimum bandwidth guarantee. Also in apreferred embodiment, the ATM flows are controlled so that the ATM cellstransmitted are not more than the maximum bandwidth limit. This meansthat each ATM flow is preferably controlled so that the ATM cellstransmitted are reduced when the ATM cells transmitted for the flowexceed the maximum bandwidth limit. In a preferred embodiment, thenumber of ATM cells transmitted for each realtime ATM flow will increasewhen there is excess bandwidth for realtime traffic and when the maximumbandwidth limit for the realtime traffic is not exceeded.

In a preferred embodiment, step 104 is performed by linearly increasingthe transmit fraction for each ATM flow for which excess bandwidthexists, exponentially decreasing the transmit fraction for ATM flowshaving flow rates greater than the maximum bandwidth limit, and usingthe transmit fraction to determine whether to discard individual ATMcells for the ATM flows. The transmit fraction may be zero (transmit nopackets), one (transmit all packets) or some value between zero and one.Thus, in a preferred embodiment, when a packet arrives, the currentvalue of a random number generator (not explicitly shown) is fetched.This current random number is also zero, one or some value between zeroand one. The current random number is compared to the transmit fraction.The ATM cell is transmitted when the transmit fraction for thecorresponding ATM flow is greater than or equal to the current randomnumber. Otherwise, the ATM cell is discarded. As the transmit fractionfor an ATM flow is increased in step 104, there is a greater probabilitythat an ATM cell is transmitted. In one embodiment, individual ATM cellsare transmitted or discarded without regard to any IP packets of whichthe ATM cells are a part. However, in another embodiment, EPD is used sothat if one ATM cell of an IP packet is discarded, the remaining ATMcells for the IP packet will also be discarded.

Thus, using the method 100, ATM traffic can be gracefully controlledbased upon the available bandwidth. In a preferred embodiment, thedetermination of whether available bandwidth exists is not based uponmonitoring individual ATM cells, but instead is based upon a simplermeasure, such as queue statistics. Individual packets need not bemonitored in order to provide different categories of ATM service. As aresult, different ATM flows belonging to different categories of serviceand having different ATM parameters may be efficiently and more simplycontrolled.

FIG. 3 is a more detailed flow chart depicting one embodiment of amethod 110 in accordance with the present invention for managing ATMtraffic. The method 110 is preferably one implementation of the method100. The method 110 is preferably accomplished using technologydescribed in the above-identified co-pending U.S. Patent Applications.The method 110 can be used with a switch (not shown) or other mechanism.In a preferred embodiment, the method 110 is implemented in enqueueingmechanism(s) for one or more queues.

The method 110 preferably commences after the network administrator forthe network (not shown), or other authorized user, has set a minimumbandwidth guarantee and maximum bandwidth limit for each flow of ATMcells that is to be controlled. The method 110 also preferably commencesafter remaining parameters for each of the ATM flows has been set. Thus,for flows added after the method 110 initially starts, the method 110preferably controls traffic for the flow only after the minimumbandwidth guarantee and maximum bandwidth limit are set. The minimumbandwidth guarantee and maximum bandwidth limit for different ATMservice categories are preferably set in a similar manner to the method100 of FIG. 2. Referring back to FIG. 3, the method 110 is preferablyperformed for each ATM flow that is being controlled. Each flow rate hasa minimum bandwidth guarantee and a maximum bandwidth limit.

The method 110 is preferably repeated at a constant frequency, each timea refresh period has expired. It is also preferably used to manage ATMtraffic at the edge of a network. Thus, the switch or other mechanismimplementing the method 110 is preferably located at the edge of anetwork and provides ATM traffic to or from an external destination orsource, respectively. The method 110 will, therefore, be described inthe context of the network receiving or sending ATM cells at thenetwork's edge. However, nothing prevents the method 110 from being usedin another portion of the network (not shown), between individual hostsor between networks (not shown).

It is determined whether excess bandwidth exists for each of the ATMflows, via step 112. In a preferred embodiment, step 112 is notperformed by monitoring individual ATM cells in each ATM flow. Instead,as described above with respect to the method 100, step 112 preferablyutilizes queue statistics in order to determine whether bandwidth existsfor the ATM flows. In a preferred embodiment, step 112 determineswhether excess bandwidth exists once for all realtime ATM traffic andonce for all non-realtime ATM traffic. Thus, in a preferred embodiment,step 112 includes monitoring one queue that stores realtime traffic andmonitoring another queue that stores non-realtime traffic, thendetermining whether excess bandwidth exists for the corresponding flows.Thus, the determination of excess bandwidth is preferably the same forall ATM flows that include realtime traffic. Similarly, thedetermination of excess bandwidth is preferably the same for all ATMflows that include non-realtime traffic. However, nothing prevents theuse of a different number of queues and/or organizing the queuesdifferently. Note that the determination of excess bandwidth in step 112is not based upon monitoring of individual ATM cells. Instead, queuestatistics or other indicator of the flow of ATM traffic for the ATMflows is used.

In a preferred embodiment, step 112 also includes providing an excessbandwidth signal, B, and an average excess bandwidth signal, E. Theexcess bandwidth signal B is one when excess bandwidth exists and zerowhen excess bandwidth is not available. The average excess bandwidthsignal, E, is preferably an exponentially weighted moving average of B.Thus, E is greater than or equal to zero and less than or equal to one.B and E are calculated each refresh period.

One of the ATM flows is selected, via step 114. It is determined whetherthe flow rate of ATM cells transmitted for the selected ATM flow is lessthan the minimum bandwidth guarantee for the selected flow, via step116. If so, then the transmit fraction for the selected ATM flow isgracefully increased toward one, via step 118. A graceful increase ordecrease occurs when the transmit fraction is gradually increased ordecreased, respectively, toward the upper limit (1) or lower limit (0),respectively. In a preferred embodiment, the transmit fraction islinearly increased in step 118. Thus, the flow rate of transmitted ATMcells for the selected ATM flow should increase over the refresh period.

If the flow rate for transmitted ATM cells is not less than the minimumbandwidth guarantee, then it is determined whether the flow rate of ATMcells transmitted is greater than the maximum bandwidth limit, via step120. If the flow rate of ATM cells transmitted is greater than themaximum bandwidth limit, then the transmit fraction is gracefullydecreased toward zero. Preferably, this graceful decrease includesexponentially decreasing the transmit fraction. Thus, the flow rate oftransmitted ATM cells for the selected ATM flow should decrease over therefresh period. Thus, using step 120, the flow rate of transmitted ATMcells can effectively be prevented from being greater than the maximumbandwidth limit.

If the flow rate for transmitted ATM cells is less than the maximumbandwidth limit, then it is determined whether there is excess bandwidthavailable for the ATM flow, via step 124. Step 124 preferably includesdetermining whether B is a one for the selected ATM flow. As discussedabove, the excess bandwidth availability is determined for realtime andnon-realtime ATM flows. Thus, for example, if B is a one for onerealtime flow, then B will be a one for all realtime ATM flows. If thereis excess bandwidth available, then the transmit fraction is gracefullyincreased, via step 128. In a preferred embodiment, step 126 includeslinearly increasing the transmit fraction for the selected ATM flow ifexcess bandwidth is available. Also in a preferred embodiment, theamount that the transmit fraction increases depends upon E and,therefore, upon how long excess bandwidth has been available. Whencalculated using step 126, the transmit fraction for the current refreshperiod is preferably:

T _(j) =T _(j−1) +E*C _(i)

where:

-   C_(i)=constant selected for the ith ATM flow-   T_(j)=transmit fraction for the selected ATM flow for the current    refresh period-   T_(j−1)=transmit fraction for the selected ATM flow for the previous    refresh period

In a preferred embodiment, the constant, C, for the flow is preferablyselected based upon the priority of the flow. If different ATM flowshave different priorities, the C_(i)'s are different. Suppose thepriorities correspond to P=0, 1, 2, 3, 4 . . . . The highest priority,P=0, preferably has the highest C₀. In a preferred embodiment ATM flowshaving the highest priority have C₀= 1/128. Lower priority ATM flowshave lower constants. Preferably C_(i+1)=Ci/₂. Thus, C₁= 1/256, C₂=1/512 and so on. As a result, the higher priority ATM flows willincrease their transmission fraction in step 126 more quickly than lowerpriority ATM flows. Higher priority ATM flows take excess bandwidth morereadily than lower priority flows.

If there is no excess bandwidth available, then the transmit fraction isgracefully decreased, via step 128. In a preferred embodiment, step 126includes exponentially decreasing the transmit fraction for the selectedATM flow if excess bandwidth is not available. Thus, the amount that thetransmit fraction decreases depends upon the transmit fraction for theprevious period. When calculated using step 128, the transmit fractionfor the current refresh period is preferably:

T _(j) =T _(j−1) f _(j−1) *D _(i)

where:

-   Di=constant selected for the ith ATM flow-   T_(j)=transmit fraction for the selected ATM flow for the current    refresh period-   T_(j−1)=transmit fraction for the selected ATM flow for the previous    refresh period-   f_(j−1)=transmitted flow rate for the selected ATM flow for the    previous refresh period expressed as a fraction of the physical rate    observed divided by the maximum possible physical rate (a constant)

In a preferred embodiment., the constant D_(i), for the flow ispreferably selected based upon the priority of the flow. If differentATM flows have different priorities, the D_(i)'s are different. Supposethe priorities correspond to P=0, 1, 2, 3. The ATM flow with priority 3has the lowest priority. In a preferred embodiment, ATM flows having thehighest priority have D₀=1132. Lower priority ATM flows have largerconstants. Preferably D_(i−1)=D_(i)*2 (where * denotes multiplication).Thus, D₁= 1/16, D₂=⅛ and D₃=¼. As a result, the higher priority ATMflows will decrease their transmission fraction in step 128 more slowlythan lower priority ATM flows. Higher priority ATM flows retain theirbandwidth to a greater extent than lower priority flows.

Once the transmit fraction is set in step 118, 122, 126, or 128, it isdetermined whether there are any other ATM flows for which the transmitfraction is to be set, via step 130. If so, then step 114, selecting thenext ATM flow, is returned to. If the transmit fraction has been set forall ATM flows, then the transmit fractions are stored for use indetermining whether to transmit or discard packets in the ATM flowsduring the refresh period via step 132. The same stored transmitfraction are also used to calculate the next transmit fraction values.In a preferred embodiment, the transmit fraction is compared to a randomnumber in step 132, as described above. If the transmit fraction isgreater than the random number, then the ATM cell is transmitted.Otherwise, the ATM cell is dropped. In one embodiment, EPD is used todrop other ATM cells in the same IP packet. When the refresh period hasexpired, then step 112 is returned to.

Thus, using the method 110, ATM traffic can be gracefully controlledbased upon the available bandwidth. The determination of whetheravailable bandwidth exists is not based upon monitoring individual ATMcells, but instead is based upon a simpler measure, such as queuestatistics. As a result, different ATM flows belonging to differentcategories of service and having different ATM parameters may beefficiently and more simply controlled.

FIG. 4 is a block diagram of one preferred embodiment of a system 200 inaccordance with the present invention for managing ATM traffic. Thesystem 200 preferably implements the methods 100 and/or 110. The system200 includes a flow control mechanism 210, ATM flows 222, 224, 232, and234 from realtime traffic 220 and non-realtime traffic 230, discardmechanisms 226, 228, 236, and 238 that are pictured as valves. Thesystem 200 also includes queues 240 and 242, scheduler 250 and anentrance/exit 252 for the network of which the system 200 is a part. TheATM flows 222 and 224 are for realtime traffic. The ATM flows 232 and234 are non-realtime flows. For exemplary purposes, the system 200 isshown as controlling four ATM flows 222, 224, 232, and 234. However,nothing prevents the use of another number of ATM flows. In a preferredembodiment, the flow control mechanism 210 is an enqueueing mechanism210 that uses discard mechanisms 226, 228, 236, and 238 to transmit ordiscard ATM cells traveling toward the queues 240 and 242. The firstqueue 240 is for realtime traffic, while the second queue 242 is fornon-realtime traffic.

The flow control mechanism 210 implements at least a portion of themethod 100 and/or 110. Thus, the flow control mechanism 210 determineswhether excess bandwidth exists and, in a preferred embodiment, adjuststhe transmission fractions for the ATM flows 222, 224, 232, and 234accordingly. In a preferred embodiment, the enqueueing mechanism 210determines whether excess bandwidth exists for all realtime traffic 220.The enqueueing mechanism preferably makes this determination based uponthe statistics for the queue 240. For example, the enqueueing mechanism210 may determine that excess bandwidth exists when the occupancy of thequeue 240 is below a certain threshold, such as ten percent occupancy,or when the occupancy of the queue 240 is below twenty percent occupancyand decreasing. Thus, the enqueueing mechanism preferably implementssteps 102 and/or 112 of the methods 100 and 110, respectively.

The enqueueing mechanism 210 controls the discard mechanisms 226, 228,236, and 238 to transmit or discard ATM cells for the ATM flows 222,224, 232, and 236 based upon the existence of excess bandwidth. In apreferred embodiment, the enqueueing mechanism 210 updates the transmitfraction for each of the ATM flows 222, 224, 232, and 234 based uponwhether excess bandwidth exists. In a preferred embodiment, the transmitfraction for the ATM flows 222 and 224 will be updated in a similarmanner because these ATM flows 222 and 224 both include realtimetraffic. Similarly, the transmit fraction for the ATM flows 232 and 234will be updated in a similar manner because these ATM flows 232 and 234both include non-realtime traffic. However, the values of the transmitfraction for the ATM flows 222, 224, 232, and 234 may differ. Thus, theATM flows 222, 224, 232, and 234 may take up or relinquish bandwidth toa different extent.

In addition, the enqueueing mechanism 210 ensures that certainparameters are met so that the system 200 can adequately handle the ATMtraffic through the network (not shown). The enqueueing mechanism 210preferably ensures that the minimum rate of each flows is actuallyallocated, if the flow offers at least that much traffic, and that themaximum rates of each flow is enforced, if the flow offers more than itsmaximum rate.

ATM cells that are transmitted are provided to the queue 240 or thequeue 242. The queues 240 and 242 preferably output ATM cells infirst-in-first-out (FIFO) order. The scheduler 250 selects ATM cellsfrom the queue 240 or 242 and outputs the ATM cell to the entrance/exit252. In a preferred embodiment, the scheduler 250 only takes an ATM cellfrom the queue 242 holding non-realtime traffic when the queue 240 isempty. Thus, the realtime traffic will be more rapidly processed.However, in another embodiment, the scheduler 250 may take packets fromthe queue 242 more often, for example when the queue 240 reaches acertain, low threshold. Consequently, the scheduler 250 does notdetermine whether and when to discard ATM cells.

Because the enqueueing mechanism 210 controls the admission of ATM cellsinto the queues 240 and 242, the occupancies of the queues 240 and 242may be lower than if the scheduler 250 performed the above-describedflow control based upon discard actions triggered by flow queueoccupancy exceeding a threshold, especially if the threshold is set at ahigh value for the purpose of tolerating bursts. Consequently, thequeues 240 and 242 generally have a lower occupancy and, therefore, alower latency. In addition, because the enqueueing mechanism controlsthe transmission of ATM cells based upon queue statistics, theenqueueing mechanism 210 need not monitor each ATM cell entering thesystem 200. In addition, the scheduler 250 does not determine whether todiscard ATM cells for each flow. Thus, the scheduler 250 is simpler andmore efficient. Furthermore, because of the use of the enqueueingmechanism 210 in conjunction with the simpler scheduler 250, the maximumdelay a realtime packet suffers due to non-realtime processing is themaximum size of a non-realtime data unit divided by the service rate.For ATM cells having a size of fifty-three bytes and a service rate ofone hundred megabits per second, this delay is much less than onehundred milliseconds. Thus, use of the system 100 and, in a preferredembodiment, the methods 100 and/or 110, the processing of non-realtimetraffic does not adversely affect the processing of realtime traffic.

Thus, using the methods 100 and 110 and/or the system 200, ATM trafficcan be gracefully and efficiently managed. In addition the manner inwhich ATM cells are discarded and bandwidth is allocated allows for highutilization, low latency, fast convergence to a desired allocation andfair allocation of excess bandwidth between different ATM flows.

A method and system has been disclosed for managing ATM traffic.Software written according to the present invention is to be stored insome form of computer-readable medium, such as memory, CD-ROM, ortransmitted over a network, and executed by a processor. Consequently, acomputer-readable medium is intended to include a computer readablesignal which, for example, may be transmitted over a network. Althoughthe present invention has been described in accordance with theembodiments shown, one of ordinary skill in the art will readilyrecognize that there could be variations to the embodiments and thosevariations would be within the spirit and scope of the presentinvention. Accordingly, many modifications may be made by one ofordinary skill in the art without departing from the spirit and scope ofthe appended claims.

1. A computer-readable medium encoded with a computer program formanaging asynchronous transfer mode (ATM) traffic in a plurality of ATMflows, the computer program comprising executable instructions for:determining whether any of the plurality of ATM flows has excessbandwidth, each ATM flow having an ATM cell flow rate, a minimum ATMbandwidth guarantee, and a maximum ATM bandwidth limit; and responsiveto one or more ATM flows having excess bandwidth, gradually increasingthe ATM cell flow rate of each ATM flow having excessive bandwidthwithout exceeding the maximum ATM bandwidth limit of each ATM flowhaving excess bandwidth, and provided a sufficient load is offered,without falling below the minimum ATM bandwidth guarantee of each ATMflow having excess bandwidth
 2. The computer-readable medium of claim 1,wherein transmission of ATM cells in each ATM flow is based on atransmit fraction of the ATM flow such that an ATM cell is transmittedin each ATM flow only when the transmit fraction of the ATM flow isgreater than or equal to a generated random number, the transmitfraction being between zero and one, and gradually increasing the ATMcell flow rate of each ATM flow having excess bandwidthcomprises:linearly increasing the transmit fraction of each ATM flowhaving excess bandwidth towards one.
 3. The computer-readable medium ofclaim 2, wherein determining whether any of the plurality of ATM flowshas excess bandwidth comprises determining whether any of the pluralityof ATM flows has excess bandwidth in a current refresh period, providingan excess bandwidth signal for the current refresh period, the excessbandwidth signal being one when excess bandwidth exists and zero whenexcess bandwidth is not available, and providing an average excessbandwidth signal for the current refresh period, the average excessbandwidth signal being an exponentially weighted moving average of theexcess bandwidth signal, and linearly increasing the transmit fractionof each ATM flow having excess bandwidth comprises selecting a constantfor each ATM flow having excess bandwidth, calculating a product foreach ATM flow having excess bandwidth by multiplying the constantselected for the ATM flow by the average excess bandwidth signal, andcalculating a transmit fraction of each ATM flow having excess bandwidthfor the current refresh period by adding the product calculated for theATM flow to a transmit fraction of the ATM flow for a previous refreshperiod.
 4. The computer-readable medium of claim 3, wherein selectingthe constant for each ATM flow having excess bandwidth comprises:selecting the constant for each ATM flow having excess bandwidth basedon a priority of the ATM flow.
 5. The computer-readable medium of claim1, wherein the computer program further comprises executableinstructions for: responsive to no ATM flow having excess bandwidth,gradually decreasing the ATM cell flow rate of each ATM flow.
 6. Thecomputer-readable medium of claim 5, wherein transmission of ATM cellsin each ATM flow is based on a transmit fraction of the ATM flow suchthat an ATM cell is transmitted in each ATM flow only when the transmitfraction of the ATM flow is greater than or equal to a generated randomnumber the transmit fraction being between zero and one, and graduallydecreasing the ATM cell flow rate of each ATM flow comprises:exponentially decreasing the transmit fraction of each ATM flow towardszero.
 7. The computer-readable medium of claim 6, wherein determiningwhether any of the plurality of ATM flows has excess bandwidth comprisesdetermining whether any of the plurality of ATM flows has excessbandwidth in a current refresh period, and exponentially decreasing thetransmit fraction of each ATM flow comprises selecting a constant foreach ATM flow, calculating a transmitted flow rate for each ATM flow bydividing a rate of ATM cell transmission observed for the ATM flow by amaximum rate of ATM cell transmission obtainable by any of the pluralityof ATM flows, calculating a product for each ATM flow by multiplying theconstant selected for the ATM flow by the transmitted flow ratecalculated for the ATM flow, and calculating a transmit fraction of eachATM flow for the current refresh period by subtracting the productcalculated for the ATM flow from a transmit fraction of the ATM flow fora previous refresh period.
 8. The computer-readable medium of claim 7,wherein selecting the constant for each ATM flow comprises: selectingthe constant for each ATM flow based on a priority of the ATM flow.
 9. Asystem for managing asynchronous transfer mode (ATM) traffic in aplurality of ATM flows, the system comprising: at least one queuestoring ATM cells to be transmitted; and a flow control mechanism incommunication with the at least one queue, the flow control mechanismdetermining whether any of the plurality of ATM flows has excessbandwidth, each ATM flow having an ATM cell flow rate, a minimum ATMbandwidth guarantee, and a maximum ATM bandwidth limit; and responsiveto one or more ATM flows having excess bandwidth, gradually increasingthe ATM cell flow rate of each ATM flow having excessive bandwidthwithout exceeding the maximum ATM bandwidth limit of each ATM flowhaving excess bandwidth, and provided a sufficient load is offered,without failing below the minimum ATM bandwidth guarantee of each ATMflow having excess bandwidth.
 10. The system of claim 9, whereintransmission of ATM cells in each ATM flow is based on a transmitfraction of the ATM flow such that an ATM cell is transmitted in eachATM flow only when the transmit fraction of the ATM flow is greater thanor equal to a generated random number, the transmit fraction beingbetween zero and one, and gradually increasing the ATM cell flow rate ofeach ATM flow having excess bandwidth comprises: linearly increasing thetransmit fraction of each ATM flow having excess bandwidth towards one.11. The system of claim 10, wherein determining whether any of theplurality of ATM flows has excess bandwidth comprises determiningwhether any of the plurality of ATM flows has excess bandwidth in acurrent refresh period, providing an excess bandwidth signal for thecurrent refresh period, the excess bandwidth signal being one whenexcess bandwidth exists and zero when excess bandwidth is not available,and providing an average excess bandwidth signal for the current refreshperiod, the average excess bandwidth signal being an exponentiallyweighted moving average of the excess bandwidth signal, and linearlyincreasing the transmit fraction of each ATM flow having excessbandwidth comprises selecting a constant for each ATM flow having excessbandwidth, calculating a product for each ATM flow having excessbandwidth by multiplying the constant selected for the ATM flow by theaverage excess bandwidth signal, and calculating a transmit fraction ofeach ATM flow having excess bandwidth for the current refresh period byadding the product calculated for the ATM flow to a transmit Fraction ofthe ATM flow for a previous refresh period.
 12. The system of claim 11,wherein selecting the constant for each ATM flow having excess bandwidthcomprises: selecting the constant for each ATM flow having excessbandwidth based on a priority of the ATM flow.
 13. The system of claim9, wherein the flow control mechanism further responsive to no ATM flowhaving excess bandwidth, gradually decreases the ATM cell flow rate ofeach ATM flow.
 14. he system of claim 13, wherein transmission of ATMcells in each ATM flow is based on a transmit fraction of the ATM flowsuch that an ATM cell is transmitted in each ATM flow only when thetransmit fraction of the ATM flow is greater than or equal to agenerated random number, the transmit fraction being between zero andone, and gradually decreasing the ATM cell flow rate of each ATM flowcomprises: exponentially decreasing the transmit fraction of each ATMflow towards zero.
 15. The system of claim 14, wherein determiningwhether any of the plurality of ATM flows has excess bandwidth comprisesdetermining whether any of the plurality of ATM flows has excessbandwidth in a current refresh period, and exponentially decreasing thetransmit fraction of each ATM flow comprises selecting a constant foreach ATM flow, calculating a transmitted flow rate for each ATM flow bydividing a rate of ATM cell transmission observed for the ATM flow by amaximum rate of ATM cell transmission obtainable by any of the pluralityof ATM flows, calculating a product for each ATM flow by multiplying theconstant selected for the ATM flow by the transmitted flow ratecalculated for the ATM flow, and calculating a transmit fraction of eachATM flow for the current refresh period by subtracting the productcalculated for the ATM flow from a transmit fraction of the ATM flow fora previous refresh period.
 16. The system of claim 15, wherein selectingthe constant for each ATM flow comprises: selecting the constant foreach ATM flow based on a priority of the ATM flow.